A Safe Recursion Scheme for Exponential Time
نویسنده
چکیده
Using a function algebra characterization of exponential time due to Monien 5], in the style of Bellantoni-Cook 2], we characterize exponential time functions of linear growth via a safe course-of-values recursion scheme.
منابع مشابه
Solution of Higher-Order, Multipoint, Nonlinear Boundary Value Problems with High-Order Robin-Type Boundary Conditions by the Adomian Decomposition Method
In this paper, we propose a new modified recursion scheme for the approximate solution of higher-order, multipoint, nonlinear boundary value problems with higher-order Robin-type boundary conditions by the Adomian decomposition method. Our new approach utilizes all of the boundary conditions to derive an equivalent nonlinear Fredholm-Volterra integral equation before establishing the new modifi...
متن کاملIntegration on Surreal Numbers
The thesis concerns the (class) structure No of Conway’s surreal numbers. The main concern is the behaviour on No of some of the classical functions of real analysis, and a definition of integral for such functions. In the main texts on No, most definitions and proofs are done by transfinite recursion and induction on the complexity of elements. In the thesis I consider a general scheme of defi...
متن کاملکارایی روش های مختلف آنالیز آماری در تخمین مؤلفه های آب نمود واحد مصنوعی آبخیزهای شمال کشور
The present research aimed to compare different methods of statistical analysis and to select the best method for achievement to the model among components of synthetic unit hydrograph by using of the physical characteristics of catchments, in northern catchments of Iran, with the area of 177000 km2 in Giulan, Mazandaran and Golestan Provinces. For execution of the research, 9 physical charac...
متن کاملA term rewriting characterization of the polytime functions and related complexity classes
A natural term rewriting framework for the Bellantoni Cook schemata of predicative recursion, which yields a canonical definition of the polynomial time computable functions, is introduced. In terms of an exponential function both, an upper bound and a lower bound are proved for the resulting derivation lengths of the functions in question. It is proved that any natural reduction strategy yield...
متن کاملPola: A Language for PTIME Programming
Pola is a functional style programming language—currently under development—whose type system guarantees that all its programs run in polynomial time. Indeed, as every polynomial time (PTIME) algorithm can be rendered in Pola, the language is complete for polynomial time programming. Furthermore, to someone familiar with functional programming, Pola enforces a style of programming which is—rela...
متن کامل